Local Search for the Steiner Tree Problem in the Euclidean Plane Local Search for the Steiner Tree Problem in the Euclidean Plane
نویسنده
چکیده
Most heuristics for the Steiner tree problem in the Euclidean plane perform a series of iterative improvements using the minimum spanning tree as an initial solution. We may therefore characterize them as local search heuristics. In this paper, we rst give a survey of existing heuristic approaches from a local search perspective, by setting up solution spaces and neighbourhood structures. Secondly, we present a new general local search approach which is based on a list of full Steiner trees constructed in a preprocessing phase. This list deenes a solution space on which three neighbourhood structures are proposed and evaluated. Computational results show that this new approach is very competitive from a cost-beneet point of view. Furthermore, it has the advantage of being easy to apply to the Steiner tree problem in other metric spaces and to obstacle avoiding variants.
منابع مشابه
Local search for the Steiner tree problem in the Euclidean plane
Most heuristics for the Steiner tree problem in the Euclidean plane perform a series of iterative improvements using the minimum spanning tree as an initial solution. We may therefore characterize them as local search heuristics. In this paper, we ®rst give a survey of existing heuristic approaches from a local search perspective, by setting up solution spaces and neighbourhood structures. Seco...
متن کاملTwo Heuristics for the Euclidean Steiner Tree Problem
The Euclidean Steiner tree problem is to find the tree with minimal Euclidean length spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set (Steiner points). The problem is NP-hard, so polynomial-time heuristics are desired. We present two such heuristics, both of which utilize an efficient method for computing a locally optimal tree with a given topol...
متن کاملTwo Heuristics for the Steiner Tree Problem
The Steiner tree problem is to nd the tree with minimal Euclidean length spanning a set of xed points in the plane, given the ability to add points (Steiner points). The problem is NP-hard, so polynomial-time heuristics are desired. We present two such heuristics, both of which utilize an eecient method for computing a locally optimal tree with a given topology. The rst systematically inserts S...
متن کاملEffectiveness of Local Search for Geometric Optimization
What is the effectiveness of local search algorithms for geometric problems in the plane? We prove that local search with neighborhoods of magnitude 1/ c is an approximation scheme for the following problems in the Euclidean plane: TSP with random inputs, Steiner tree with random inputs, uniform facility location (with worst case inputs), and bicriteria k-median (also with worst case inputs). T...
متن کاملAlgorithms for the power-p Steiner tree problem in the Euclidean plane
We study the problem of constructing minimum power-p Euclidean k-Steiner trees in the plane. The problem is to find a tree of minimum cost spanning a set of given terminals where, as opposed to the minimum spanning tree problem, at most k additional nodes (Steiner points) may be introduced anywhere in the plane. The cost of an edge is its length to the power of p (where p ≥ 1), and the cost of ...
متن کامل